Using Decision Trees and Soft Labeling to Filter Mislabeled Data
نویسندگان
چکیده
منابع مشابه
Speech recognition using soft decision trees
This paper presents recent developments at our site toward speech recognition using decision tree based acoustic models. Previously, robust decision trees have been shown to achieve better performance compared to standard Gaussian mixture model (GMM) acoustic models. This was achieved by converting hard questions (decisions) of a standard tree into soft questions using sigmoid function. In this...
متن کاملUsing Decision Trees to Understand Student Data
We apply and evaluate a decision tree algorithm to university records, producing human-readable graphs that are useful both for predicting graduation, and understanding factors that lead to graduation. We compare this method to that of nueral networks, Support Vector Machines, and Kernel Regression, and show that it is equally powerful as a classificaion tool. At the same time, decision trees p...
متن کاملBagging Soft Decision Trees
The decision tree is one of the earliest predictive models in machine learning. In the soft decision tree, based on the hierarchical mixture of experts model, internal binary nodes take soft decisions and choose both children with probabilities given by a sigmoid gating function. Hence for an input, all the paths to all the leaves are traversed and all those leaves contribute to the final decis...
متن کاملBlock-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based sc...
متن کاملConstruction of Decision Trees Using Data Cube
Data classification is an important problem in data mining. The traditional classification algorithms based on decision trees have been widely used due to their fast model construction and good model understandability. However, the existing decision tree algorithms need to recursively partition dataset into subsets according to some splitting criteria i.e. they still have to repeatedly compute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Systems
سال: 2008
ISSN: 2191-026X,0334-1860
DOI: 10.1515/jisys.2008.17.4.331